Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming
نویسندگان
چکیده
We study split cuts and extended formulations for Mixed Integer Conic Quadratic Programming (MICQP) and their relation to Conic Mixed Integer Rounding (CMIR) cuts. We show that CMIR is a linear split cut for the polyhedral portion of an extended formulation of a quadratic set and it can be weaker than the nonlinear split cut of the same quadratic set. However, we also show that families of CMIRs can be significantly stronger than the associated family of nonlinear split cuts.
منابع مشابه
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
We study several joint facility location and inventory management problems with stochastic retailer demand. In particular, we consider cases with uncapacitated facilities, capacitated facilities, correlated retailer demand, stochastic lead times, and multicommodities. We show how to formulate these problems as conic quadratic mixed-integer problems. Valid inequalities, including extended polyma...
متن کاملExtended formulations in mixed integer conic quadratic programming
In this paper we consider the use of extended formulations in LP-based algorithms for mixed integer conic quadratic programming (MICQP). Through an homogenization procedure we generalize an existing extended formulation to general conic quadratic constraints. We then compare its effectiveness against traditional and extended formulation-based algorithms for MICQP. We find that this new extended...
متن کاملA conic quadratic model for supply chain network design under hub, capacity, delay and lost sale
In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...
متن کاملIntersection Cuts for Mixed Integer Conic Quadratic Sets
Balas introduced intersection cuts for mixed integer linear sets. Intersection cuts are given by closed form formulas and form an important class of cuts for solving mixed integer linear programs. In this paper we introduce an extension of intersection cuts to mixed integer conic quadratic sets. We identify the formula for the conic quadratic intersection cut by formulating a system of polynomi...
متن کاملCuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015